def mul(a, b, mod):
    p = len(a)
    q = len(b[0])
    m = len(a[0])
    c = [[0 for i in xrange(q)] for j in xrange(p)]
    for i in xrange(p):
        for j in xrange(q):
            for k in xrange(m):
                c[i][j] += a[i][k] * b[k][j]
                c[i][j] %= mod
    return c

def powmod(a, n, mod):
    if n == 1:
        return a
    n2 = n / 2
    b = powmod(a, n2, mod)
    c = mul(b, b, mod)
    if n % 2 == 1:
        c = mul(c, a, mod)
    return c

MOD = 1234567891011
def f(n, mod):
    a = [[1, 1],[1, 0]]
    b = powmod(a, n, mod)
    return b[0][1]

n = 10 ** 14

print f(n, MOD), f(n+1, MOD)
